Discrete Cat Swarm Optimization to Resolve the Traveling Salesman Problem
نویسندگان
چکیده
This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu and Tsai for optimization problems in the continuous case. To solve TSP, which is a discrete problem, we will describe the various operators and operations performed in two different modes of this algorithm, which is the searching mode (TM) and the tracing mode (SM). At the end, we will demonstrate the success of the proposed terms.
منابع مشابه
Solving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کاملA Particle Swarm Optimization Based on Evolutionary Game Theory for Discrete Combinatorial Optimization
This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition ,we make a mapping among the three parts discrete particle swarm optimization (DPSO)、 evolutionary game the...
متن کاملA Modified Discrete Particle Swarm Optimization Algorithm for the Generalized Traveling Salesman Problem
متن کامل
Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013